6.841: Advanced Complexity Theory Fall 2012
نویسنده
چکیده
Randomness is an incredibly useful phenomenon, with applications in many fields. We can solve some problems using randomness exponentially faster than we know how to do deterministically. Do we need truly random bits for these algorithms? What if we don’t have access to perfect randomness? Using results from the theory of computational pseudorandomness, we find that many algorithms can be made to work with very weak sources of randomness, and possibly with no randomness at all.
منابع مشابه
6.841: Advanced Complexity Theory Fall 2012
The key ingredient is the so-called Switching Lemma. To state it we need a notion of p-restrictions. Say we have a function f : {0, 1}n → {0, 1}. Then we say that a function f ′ is a p-restriction of f , if it is obtained from f via the following process. Each variable is set to zero with probability (1− p)/2, and is set to one with the same probability (so, with probability p a variable is not...
متن کاملAdvanced Complexity Theory Fall 2012 Lecture 15 — November 1 , 2012
Q: Why are we using circuit lower bounds here, as opposed to a claim such as E ̸⊆ P for example? A: The proof of the Nisan-Wigderson pseudorandom generator relies on nonuniformity, by showing that distinguishing a pseudorandom generator implies a circuit for solving a hard problem – this reduction involves hardwiring advice into a circuit in order to solve the hard problem. A contradiction requi...
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملCS5236 – Advanced Automata Theory
Advanced Automata Theory is a lecture which will first review the basics of formal languages and automata theory and then give insight into specific topics from the theory of automata theory. In computer science, automata are an important tool for many theoretical results and various types of automata have been used to characterise complexity classes. The lecture will give a deeper understandin...
متن کاملInvestigating the relationship among complexity, range, and strength of grammatical knowledge of EFL students
Assessment of grammatical knowledge is a rather neglected area of research in the field with many open questions (Purpura, 2004). The present research incorporates recent proposals about the nature of grammatical development to create a framework consisting of dimensions of complexity, range and strength, and studies which dimension(s) can best predict the stat...
متن کامل